From a Polynomial Riemann Hypothesis to Alternating Sign Matrices
نویسندگان
چکیده
This paper begins with a brief discussion of a class of polynomial Riemann hypotheses, which leads to the consideration of sequences of orthogonal polynomials and 3-term recursions. The discussion further leads to higher order polynomial recursions, including 4-term recursions where orthogonality is lost. Nevertheless, we show that classical results on the nature of zeros of real orthogonal polynomials (i. e., that the zeros of pn are real and those of pn+1 interleave those of pn) may be extended to polynomial sequences satisfying certain 4-term recursions. We identify specific polynomial sequences satisfying higher order recursions that should also satisfy this classical result. As with the 3-term recursions, the 4-term recursions give rise naturally to a linear functional. In the case of 3-term recursions the zeros fall nicely into place when it is known that the functional is positive, but in the case of our 4-term recursions, we show that the functional can be positive even when there are non-real zeros among some of the polynomials. It is interesting, however, that for our 4-term recursions positivity is guaranteed when a certain real parameter C satisfies C ≥ 3, and this is exactly the condition of our result that guarantees the zeros have the aforementioned interleaving property. We conjecture the condition C ≥ 3 is also necessary. Next we used a classical determinant criterion to find exactly when the associated linear functional is positive, and we found that the Hankel determinants ∆n formed from the sequence of moments of the functional when C = 3 give rise to the initial values of the integer sequence 1, 3, 26, 646, 45885, · · · , of Alternating Sign Matrices (ASMs) with vertical symmetry. This spurred an intense interest in these moments, and we give 9 diverse characterizations of this sequence of moments. We then specify these Hankel determinants as ∗Supported in part by NSF Grant No. CCR–9821038. the electronic journal of combinatorics 8 (2001), #R36 1 Macdonald-type integrals. We also provide an an infinite class of integer sequences, each sequence of which gives the Hankel determinants ∆n of the moments. Finally we show that certain n-tuples of non-intersecting lattice paths are evaluated by a related class of special Hankel determinants. This class includes the ∆n. At the same time, ASMs with vertical symmetry can readily be identified with certain n-tuples of osculating paths. These two lattice path models appear as a natural bridge from the ASMs with vertical symmetry to Hankel determinants.
منابع مشابه
Pattern Avoidance in Alternating Sign Matrices
We generalize the definition of a pattern from permutations to alternating sign matrices. The number of alternating sign matrices avoiding 132 is proved to be counted by the large Schröder numbers, 1, 2, 6, 22, 90, 394 . . .. We give a bijection between 132-avoiding alternating sign matrices and Schröder-paths, which gives a refined enumeration. We also show that the 132, 123avoiding alternatin...
متن کاملHigher Spin Alternating Sign Matrices
We define a higher spin alternating sign matrix to be an integer-entry square matrix in which, for a nonnegative integer r, all complete row and column sums are r, and all partial row and column sums extending from each end of the row or column are nonnegative. Such matrices correspond to configurations of spin r/2 statistical mechanical vertex models with domain-wall boundary conditions. The c...
متن کاملAffine Alternating Sign Matrices
An Alternating sign matrix is a square matrix of 0’s, 1’s, and −1’s in which the sum of the entries in each row or column is 1 and the signs of the nonzero entries in each row or column alternate. This paper attempts to define an analogue to alternating sign matrices which is infinite and periodic. After showing the analogue we define shares desirable cahracteristics with alternating sign matri...
متن کاملRefined enumerations of alternating sign matrices: monotone (d,m)-trapezoids with prescribed top and bottom row
Monotone triangles are plane integer arrays of triangular shape with certain monotonicity conditions along rows and diagonals. Their significance is mainly due to the fact that they correspond to n× n alternating sign matrices when prescribing (1,2, . . . , n) as bottom row of the array. We define monotone (d,m)-trapezoids as monotone triangles with m rows where the d − 1 top rows are removed. ...
متن کاملPrime Power Divisors of the Number of n x n Alternating Sign Matrices
We let A(n) equal the number of n×n alternating sign matrices. From the work of a variety of sources, we know that
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 8 شماره
صفحات -
تاریخ انتشار 2001